Visualizing undirected graphs and symmetric square matrices as overlapping sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large Cliques and Stable Sets in Undirected Graphs

The cochromatic number of a graph G is the minimum number of stable sets and cliques of G covering the vertex-set of G. In this paper we survey some resent results and techniques developed in an attempt to answer the question: excluding which induced subgraphs causes a graph to have bounded cochromatic number?

متن کامل

Using Graphs to Visualize Overlapping Sets

The large volume of data available in many domains and the need to analyze the data to extract useful information from it has lead to the need of visualization techniques to get information about the data at a glance. Visual inspection is useful in providing fast and abstract information about datasets to guide the researchers in choosing the suitable approach to process the data. Recently, the...

متن کامل

Simple Undirected Graphs as Formal Contexts

The adjacency matrix of a graph is interpreted as a formal context. Then, the counterpart of Formal Concept Analysis (FCA) tools are introduced in graph theory. Moreover, a formal context is seen as a Boolean information table, the structure at the basis of Rough Set Theory (RST). Hence, we also apply RST tools to graphs. The peculiarity of the graph case, put in evidence and studied in the pap...

متن کامل

A fast symmetric SVD algorithm for square Hankel matrices

This paper presents an O(n2 log n) algorithm for computing the symmetric singular value decomposition of square Hankel matrices of order n, in contrast with existing O(n3) SVD algorithms. The algorithm consists of two stages: first, a complex square Hankel matrix is reduced to a complex symmetric tridiagonal matrix using the block Lanczos method in O(n2 log n) flops; second, the singular values...

متن کامل

A Square Block Format for Symmetric Band Matrices

This contribution describes a Square Block, SB, format for storing a banded symmetric matrix. This is possible by rearranging “in place” LAPACK Band Layout to become a SB layout: store submatrices as a set of square blocks. The new format reduces storage space, provides higher locality of memory accesses, results in regular access patterns, and exposes parallelism.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Multimedia Tools and Applications

سال: 2019

ISSN: 1380-7501,1573-7721

DOI: 10.1007/s11042-019-7655-8